منابع مشابه
Distance Labeling for Permutation Graphs
We show that every permutation graph with n elements can be preprocessed in O(n) time, if two linear extensions of the corresponding poset are given, to produce an O(n) space data-structure supporting distance queries in constant time. The datastructure is localized and given as a distance labeling, that is each vertex receives a label of O(log n) bits so that distance queries between any two v...
متن کاملOn the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملon the tenacity of cycle permutation graph
a special class of cubic graphs are the cycle permutation graphs. a cycle permutation graph pn( α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.in this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملOn Transitive Permutation Groups
We assign names and new generators to the transitive groups of degree up to 15, reflecting their structure.
متن کاملOn Permutation Cliques
The symmetric group S , is a metric space with distance d(a , b ) = IE(a-'b)( where E ( c ) is the set of points moved by c E S,. Let L be a given subset of {I. 2, . . . , n}, a permutation clique A = A(L, n ) is any subset A c S , with d(a, b ) E L whenever a, b E A , a # b. We give a framework of new and known information o n some special A = A ( L , n): maximal, largest, largest subgroups of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Egyptian Mathematical Society
سال: 2011
ISSN: 1110-256X
DOI: 10.1016/j.joems.2011.10.006